Capacity-Oriented Train Scheduling of High-Speed Railway Considering the Operation and Maintenance of Rolling Stock

The capacity of some busy rail lines is increasingly tight and passenger demand far exceeds the railway capacity. To schedule as many trains possible in order to satisfy more transportation demands, we studied capacity-oriented train scheduling problem. While most approaches focus only on increasing line, this research considers both time-space distribution demands operation maintenance rolling stock. solve problem, first constructed a network describe path We then proposed an integer planning model with stock OD service frequency constraints maximize number running arcs sections. After decomposing by introducing Lagrangian multipliers relax its hard constraints, relaxation-based decomposition algorithm, including two search sub-algorithms for optimize relaxed feasible solutions. Finally, conducted computation study practical double-track high-speed line test performance algorithm. It reports that timetables are well managed.